Balanced allocation: Memory performance tradeoffs
نویسندگان
چکیده
منابع مشابه
Balanced Allocation: Memory Performance Tradeoffs
Suppose we sequentially put n balls into n bins. If we put each ball into a random bin then the heaviest bin will contain ∼ logn/ log logn balls with high probability. However, Azar, Broder, Karlin and Upfal [SIAM J. Comput. 29 (1999) 180–200] showed that if each time we choose two bins at random and put the ball in the least loaded bin among the two, then the heaviest bin will contain only ∼ l...
متن کاملOverhead Performance Tradeoffs - A Resource Allocation Perspective
A key aspect of many resource allocation problems is the need for the resource controller to compute a function, such as the max or argmax, of the competing users metrics. Information must be exchanged between the competing users and the resource controller in order for this function to be computed. In many practical resource controllers the competing users’ metrics are communicated to the reso...
متن کاملPerformance Tradeoffs for Static Allocation of Zero-Copy Buffers
Internet services like the world-wide web and multimedia applications like Newsand Video-on-Demand have become very popular over the last years. Due to the large number of users that retrieve multimedia data with high data rates concurrently, the data servers represent a severe bottleneck in this context. Traditional time and resource consuming operations like memory copy operations limit the n...
متن کاملDerandomized Balanced Allocation
In this paper, we study the maximum loads of explicit hash families in the d-choice schemes when allocating sequentially n balls into n bins. We consider the Uniform-Greedy scheme [ABKU99], which provides d independent bins for each ball and places the ball into the bin with the least load, and its non-uniform variant — the Always-Go-Left scheme introduced by Vöcking [Vöc03]. We construct a has...
متن کاملPerfectly Balanced Allocation
We investigate randomized processes underlying load balancing based on the multiple-choice paradigm: m balls have to be placed in n bins, and each ball can be placed into one out of 2 randomly selected bins. The aim is to distribute the balls as evenly as possible among the bins. Previously, it was known that a simple process that places the balls one by one in the least loaded bin can achieve ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2012
ISSN: 1050-5164
DOI: 10.1214/11-aap804